例句與造句

1. The simple Turing machine described above would thus have the description number 313322531173113325317.
2. Since ? is built up from what we have assumed are Turing machines as well then it too must have a description number, call it e.
3. First, let us denote by U ( e, x ) the action of the universal Turing machine given a description number e and input x, returning 0 if e is not the description number of a valid Turing machine.
4. First, let us denote by U ( e, x ) the action of the universal Turing machine given a description number e and input x, returning 0 if e is not the description number of a valid Turing machine.
5. Now, supposing that there were some algorithm capable of settling the halting problem, i . e . a Turing machine TEST ( e ) which given the description number of some Turing machine would return 1 if the Turing machine halts on every input, or 0 if there are some inputs that would cause it to run forever.
6. It's difficult to find description number in a sentence. 用description number造句挺難的
7. It is usually not necessary to actually compute a description number in this way : the point is that every natural number may be interpreted as the code for at most one Turing machine, though many natural numbers may not be the code for any Turing machine ( or to put it another way, they represent Turing machines that have no states ).
8. But then, if we replaced each of the seven symbols'A'by 1,'C'by 2,'D'by 3,'L'by 4,'R'by 5,'N'by 6, and';'by 7, we would have an encoding of the Turing machine as a natural number : this is the description number of that Turing machine under Turing's universal machine.